Solving the circular open dimension problem by using separate beams and look-ahead strategiesAKEB, Hakim; HIFI, Mhand.Computers & operations research. 2013, Vol 40, Num 5, pp 1243-1255, issn 0305-0548, 13 p.Article

An exact algorithm for constrained two-dimensional two-staged cutting problemsHIFI, Mhand; M'HALLAH, Rym.Operations research. 2005, Vol 53, Num 1, pp 140-150, issn 0030-364X, 11 p.Article

Knapsack Problems and ApplicationsHIFI, Mhand; M'HALLAH, Rym.Computers & operations research. 2012, Vol 39, Num 1, issn 0305-0548, 126 p.Serial Issue

A hybrid beam search looking-ahead algorithm for the circular packing problemAKEB, Hakim; HIFI, Mhand.Journal of combinatorial optimization. 2010, Vol 20, Num 2, pp 101-130, issn 1382-6905, 30 p.Article

Strip generation algorithms for constrained two-dimensional two-staged cutting problemsHIFI, Mhand; M'HALLAH, Rym.European journal of operational research. 2006, Vol 172, Num 2, pp 515-527, issn 0377-2217, 13 p.Article

Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary knapsack problemHIFI, Mhand; MHALLA, Hedi; SADFI, Slim et al.Journal of combinatorial optimization. 2005, Vol 10, Num 3, pp 239-260, issn 1382-6905, 22 p.Article

A beam search algorithm for the circular packing problemAKEB, Hakim; HIFI, Mhand; M'HALLAH, Rym et al.Computers & operations research. 2009, Vol 36, Num 5, pp 1513-1528, issn 0305-0548, 16 p.Article

Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problemDELLA CROCE, F; GROSSO, A.Computers & operations research. 2012, Vol 39, Num 1, pp 27-31, issn 0305-0548, 5 p.Article

A computational study on the quadratic knapsack problem with multiple constraintsWANG, Haibo; KOCHENBERGER, Gary; GLOVER, Fred et al.Computers & operations research. 2012, Vol 39, Num 1, pp 3-11, issn 0305-0548, 9 p.Article

Reoptimization in Lagrangian methods for the 0―1 quadratic knapsack problemLETOCART, Lucas; NAGIH, Anass; PLATEAU, Gerard et al.Computers & operations research. 2012, Vol 39, Num 1, pp 12-18, issn 0305-0548, 7 p.Article

A fuzzy DEA and knapsack formulation integrated model for project selectionCHANG, Ping-Teng; LEE, Jung-Hua.Computers & operations research. 2012, Vol 39, Num 1, pp 112-125, issn 0305-0548, 14 p.Article

Exact algorithms for the two-dimensional guillotine knapsackDOLATABADI, Mohammad; LODI, Andrea; MONACI, Michele et al.Computers & operations research. 2012, Vol 39, Num 1, pp 48-53, issn 0305-0548, 6 p.Article

A knapsack problem as a tool to solve the production planning problem in small foundriesCAMARGO, Victor C. B; MATTIOLLI, Leandro; TOLEDO, Franklina M. B et al.Computers & operations research. 2012, Vol 39, Num 1, pp 86-92, issn 0305-0548, 7 p.Article

Problem reduction heuristic for the 0―1 multidimensional knapsack problemHILL, Raymond R; YONG KUN CHO; MOORE, James T et al.Computers & operations research. 2012, Vol 39, Num 1, pp 19-26, issn 0305-0548, 8 p.Article

A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problemLEUNG, Stephen C. H; DEFU ZHANG; CHANGLE ZHOU et al.Computers & operations research. 2012, Vol 39, Num 1, pp 64-73, issn 0305-0548, 10 p.Article

A heuristic approach for allocation of data to RFID tags: A data allocation knapsack problem (DAMP)DAVIS, Lauren; SAMANLIOGLU, Funda; XIAOCHUN JIANG et al.Computers & operations research. 2012, Vol 39, Num 1, pp 93-104, issn 0305-0548, 12 p.Article

Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problemCREVITS, Igor; HANAFI, Said; MANSI, Raid et al.Computers & operations research. 2012, Vol 39, Num 1, pp 32-41, issn 0305-0548, 10 p.Article

Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflictsKHANAFER, Ali; CLAUTIAUX, François; TALBI, El-Ghazali et al.Computers & operations research. 2012, Vol 39, Num 1, pp 54-63, issn 0305-0548, 10 p.Article